Circuit Decompositions of Eulerian Graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Circuit Decompositions of Eulerian Graphs

Let G be an eulerian graph. For each vertex v # V(G), let P(v) be a partition of the edges incident with v and set P= v # V(G) P(v), called a forbidden system of G. We say that P is admissible if |P & T | 2 |T | for every P # P and every edge cut T of G. H. Fleischner and A. Frank (1990, J. Combin. Theory Ser. B 50, 245 253) proved that if G is planar and P is any admissible forbidden system of...

متن کامل

Decompositions of infinite graphs: Part II circuit decompositions

We characterize the graphs that admit a decomposition into circuits, i.e. finite or infinite connected 2-regular graphs. Moreover, we show that, as is the case for the removal of a closed eulerian subgraph from a finite graph, removal of a non-dominated eulerian subgraph from a (finite or infinite) graph does not change its circuit-decomposability or circuit-indecomposability. For cycle-decompo...

متن کامل

Compatible circuit decompositions of 4-regular graphs

A transition system T of an Eulerian graph G is a family of partitions of the edges incident to each vertex of G into transitions i.e. subsets of size two. A circuit decomposition C of G is compatible with T if no pair of adjacent edges of G is both a transition of T and consecutive in a circuit of C. We give a conjectured characterization of when a 4-regular graph has a transition system which...

متن کامل

The irregularity and total irregularity of Eulerian graphs

For a graph G, the irregularity and total irregularity of G are defined as irr(G)=∑_(uv∈E(G))〖|d_G (u)-d_G (v)|〗 and irr_t (G)=1/2 ∑_(u,v∈V(G))〖|d_G (u)-d_G (v)|〗, respectively, where d_G (u) is the degree of vertex u. In this paper, we characterize all ‎connected Eulerian graphs with the second minimum irregularity, the second and third minimum total irregularity value, respectively.

متن کامل

Editing to Eulerian Graphs

We investigate the problem of modifying a graph into a connected graph in which the degree of each vertex satisfies a prescribed parity constraint. Let ea, ed and vd denote the operations edge addition, edge deletion and vertex deletion respectively. For any S ⊆ {ea, ed, vd}, we define Connected Degree Parity Editing(S) (CDPE(S)) to be the problem that takes as input a graph G, an integer k and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 2000

ISSN: 0095-8956

DOI: 10.1006/jctb.1999.1923